The Erd\H{o}s-Straus conjecture New modular equations and checking up to N=1017N=10^{17}

In 1999 Allan Swett checked (in 150 hours) the Erd\H{o}s-Straus conjecture up to $N=10^{14}$ with a sieve based on a single modular equation. After having proved the existence of a "complete" set of seven modular equations (including three new ones), this paper offers an optimized sieve based on these equations. A program written in C++ (and given elsewhere) allows then to make a checking whose running time, on a typical computer, range from few minutes for $N=10^{14}$ to about 16 hours for $N=10^{17}$.Comment: 13 pages, 1 version fran\c{c}aise, 1 C++ progra